GRASP Combined with ILS for the Vehicle Routing Problem with Time Windows, Precedence, Synchronization and Lunch Break Constraints
نویسندگان
چکیده
In this era of pandemic especially with COVID-19, many hospitals and care structures are at full capacity regarding availability beds. This problem leads to ensure giving specific cares people in need either illness or disability their own homes. Home Health Care (HHC) proposes kind services for patients demanding it. These have be done the request patient which appears client a way that gives satisfaction requester service. Often, these demands bound by time workforce (caregivers) obligated respect addition precedence (priority) constraint. The main purpose HHC is provide service good term quality, minimize overall costs shorten losses. To reduce structures, it mandatory find comprehensible logical ways do it, not permissible touch caregiver salary, themselves obligation optimize other means such as reducing travel cost. Note give one's home, aspect important considered core spending charges institution. Another fact toward caregivers; an essential element order obtain quality service, realistic lunch break caregivers introduced parameter. For those arguments, conception efficient planning involves using decision tools optimization methods. A (vehicle) attributed (customer) number several options accordance customer wishes like windows requirement often specified client, priority constraints usually performed if before another could intervention more than one must least day always taken set versatile demand satisfaction. resolve issue called VRPTW-SPLB, mathematical model proposed explained Mixed Integer Linear Programming (MILP) greedy heuristic based on Greedy Randomized Adaptive Procedure (GRASP) proposed, two strategies local search metaheuristics, metaheuristic resultant hybridization metaheuristics. At end paper, results shown benchmark extracted from literature.
منابع مشابه
Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملA goal programming model for vehicle routing problem with backhauls and soft time windows
The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...
متن کاملTHE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS
The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...
متن کاملA Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows and Synchronization Constraints
This paper focuses on solving a variant of the vehicle routing problem (VRP) in which a time window is associated with each customer service and some services require simultaneous visits from different vehicles to be accomplished. The problem is therefore called the VRP with time windows and synchronization constraints (VRPTWSyn). We present a simulated annealing algorithm (SA) that incorporate...
متن کاملEvolutionary Approach for Energy Minimizing Vehicle Routing Problem with Time Windows and Customers’ Priority
A new model and solution for the energy minimizing vehicle routing problem with time windows (EVRPTW) and customers’ priority is presented in this paper. In this paper unlike prior attempts to minimize cost by minimizing overall traveling distance, the model also incorporates energy minimizing which meets the latest requirements of green logistics. This paper includes the vehicles load as an ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2021
ISSN: ['2158-107X', '2156-5570']
DOI: https://doi.org/10.14569/ijacsa.2021.0120521